A sufficient condition for Hamiltonicity in locally finite graphs
نویسنده
چکیده
Using topological circles in the Freudenthal compactification of a graph as infinite cycles, we extend to locally finite graphs a result of Oberly and Sumner on the Hamiltonicity of finite graphs. This answers a question of Stein, and gives a sufficient condition for Hamiltonicity in locally finite graphs.
منابع مشابه
A sufficient local degree condition for Hamiltonicity in locally finite claw-free graphs
Among the well-known sufficient degree conditions for the Hamiltonicity of a finite graph, the condition of Asratian and Khachatrian is the weakest and thus gives the strongest result. Diestel conjectured that it should extend to locally finite infinite graphs G, in that the same condition implies that the Freudenthal compactification of G contains a circle through all its vertices and ends. We...
متن کاملHamiltonicity in Locally Finite Graphs: Two Extensions and a Counterexample
We state a sufficient condition for the square of a locally finite graph to contain a Hamilton circle, extending a result of Harary and Schwenk about finite graphs. We also give an alternative proof of an extension to locally finite graphs of the result of Chartrand and Harary that a finite graph not containing K4 or K2,3 as a minor is Hamiltonian if and only if it is 2-connected. We show furth...
متن کاملOn spanning tree packings of highly edge connected graphs
We prove a refinement of the tree packing theorem by Tutte/Nash-Williams for finite graphs. This result is used to obtain a similar result for end faithful spanning tree packings in certain infinite graphs and consequently to establish a sufficient Hamiltonicity condition for the line graphs of such graphs.
متن کاملSignless Laplacian spectral radius and Hamiltonicity of graphs with large minimum degree
In this paper, we establish a tight sufficient condition for the Hamiltonicity of graphs with large minimum degree in terms of the signless Laplacian spectral radius and characterize all extremal graphs. Moreover, we prove a similar result for balanced bipartite graphs. Additionally, we construct infinitely many graphs to show that results proved in this paper give new strength for one to deter...
متن کاملOn the hamiltonicity of line graphs of locally finite, 6-edge-connected graphs
The topological approach to the study of infinite graphs of Diestel and K ̈hn has enabled several results on Hamilton cycles in finite graphs to be extended to locally finite graphs. We consider the result that the line graph of a finite 4-edge-connected graph is hamiltonian. We prove a weaker version of this result for infinite graphs: The line graph of locally finite, 6-edge-connected graph w...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Eur. J. Comb.
دوره 45 شماره
صفحات -
تاریخ انتشار 2015